Propositional Encoding of Constraints over Tree-Shaped Data
نویسندگان
چکیده
The paper presents a high-level declarative language CO4 for describing constraint systems. The language includes user-defined algebraic data types and recursive functions defined by pattern matching, as well as higher-order and polymorphic types. This language comes with a compiler that transforms a high-level constraint system into a satisfiability problem in propositional logic. This is motivated by the following.
منابع مشابه
SAT Compilation for Constraints over Finite Structured Domains
Due to the availability of powerful SAT solvers, propositional encoding is a successful technique of solving constraint systems over finite domains. As these domains are often flat and non-structured, the CO4 compiler aims to extend this concept by enriching the underlying domain with user-defined algebraic data types. Syntactically, CO4 is a subset of Haskell and allows to specify constraint s...
متن کاملAdding Logical Operators to Tree Pattern Queries on Graph-Structured Data
As data are increasingly modeled as graphs for expressing complex relationships, the tree pattern query on graph-structured data becomes an important type of queries in real-world applications. Most practical query languages, such as XQuery and SPARQL, support logical expressions using logical-AND/OR/NOT operators to define structural constraints of tree patterns. In this paper, (1) we propose ...
متن کاملSolving Partial Order Constraints for LPO Termination
This paper introduces a new kind of propositional encoding for reasoning about partial orders. The symbols in an unspecified partial order are viewed as variables which take integer values and are interpreted as indices in the order. For a partial order statement on n symbols each index is represented in dlog2 ne propositional variables and partial order constraints between symbols are modeled ...
متن کاملEfficient Encodings of Conditional Cardinality Constraints
In the encoding of many real-world problems to propositional satisfiability, the cardinality constraint is a recurrent constraint that needs to be managed effectively. Several efficient encodings have been proposed while missing that such a constraint can be involved in a more general propositional formulation. To avoid combinatorial explosion, Tseitin principle usually used to translate such g...
متن کاملInvestigation of the Performance of an Optimized Tree-Type Cylindrical-Shaped Nanoporous Filtering Membrane for Varying Operational Parameter Values
The performance of an optimized tree-type cylindrical-shaped nanoporous fltering membrane proposed in the former study is analytically investigated for varying operational parameter values. Across the membrane thickness, this membrane has two-leveled tree-structured pores including one trunk pore and the multiple branch pores. The physical properties of the surfaces of ...
متن کامل